Monte Carlo and variance reduction methods for structural reliability analysis: A comprehensive review

Monte Carlo methods have attracted constant and even increasing attention in structural reliability analysis with a wide variety of developments seamlessly presented over decades. Along the way, a number of specialized reviews and benchmark studies have been provided from time to time, aiming at summarizing and comparing selected few approaches in detail, mainly from an implementation point of view. In contrast, the aim of the present survey is to play a comprehensive role as a methodological guidebook on Monte Carlo simulation and its related, especially variance reduction, techniques through a covering of 444 references in the relevant literature. To achieve this goal, we present an extensive review of formulations and techniques along with insightful summaries of developments of existing numerical methods, ranging from the general formulation, sub-categories and variants, to their combined uses with other simulation techniques and surrogate models, as well as the key advantages and assumptions.     

网孔等值法在短路电流计算中的应用

阐述了网孔等值电路法在短路电流计算中的应用,推导的计算公式不仅对接有电力负荷、并 联电抗器和( 或)并联电容器的网络适用,在发电机的电势各不相等时也同样适用。算例对不 同负荷性质的计算结果进行 了分析。     

Improvements in data reduction in direct pulse heating calorimetry

This paper describes improvements introduced in data reduction in direct heating pulse specific heat experiments. In calculations of specific heat, it is necessary to calculate the first derivative of the recorded temperature data as a function of time. The error induced by different numerical differentiation techniques can represent a significant part of the overall measurement error. Thus, different digital filtering techniques, differentiation, and smoothing algorithms were applied and tested to examine their influence on the minimization of errors induced by noise, which is unavoidable in measured signals. A minimum square error criterion was applied in designing digital filters, with arbitrary prescribed magnitude characteristics. Attention was paid to applications when one or more structural phase transitions in the specimen material occur within the temperature range covered by the experiment. The cases where the frequency spectrum of induced noise overlaps with the spectrum of temperature transient signals originating from phase transitions were analyzed in detail. The effectiveness of the methods of extracting the final specific heat data from a noisy signal using different digital filtering techniques is demonstrated.Paper presented at the Fourth International Workshop on Subsecond Thermophysics, June 27–29, 1995, Köln, Germany.     

基于云的安全防御端系统研究与实现

详细研究了基于云的互联网安全防御系统相关理论和关键技术,设计并实现了基于云的安全防御端系统,讨论了核心功能模块的实现方法,并对其功能进行了综合测试.测试结果表明,该系统能够对客户端系统进行全方位检查和维护,帮助用户有效抵制各种网络恶意软件的侵袭.     

基于查找表的车载经纬仪测角误差修正技术

车载平台的变形对光电经纬仪测角精度将产生一定的影响,使车载经纬仪难以达到高精度测量的目的;为了提高车载经纬仪静态测角精度,提出了基于查找表的静态测角误差事后补偿技术;首先,推导出车载经纬仪的静态测角误差修正模型。然后,利用安放在经纬仪垂直轴上的倾角传感器采集车载平台变形特征值;最后,构建映射函数,建立输入值和输出值之间的查找关系,即高精度的查找表;实验数据分析结果表明:该方法能有效补偿因为车载平台变形而带来的静态测角误差,使方位测角精度提高46″,高低测角精度提高20″;为实现车载经纬仪高精度测量提供了理论依据和技术支持。     

基于混沌和小波变换的信号检测方法

针对微弱周期信号提出小波阈值去噪和混沌系统相结合的微弱周期信号检测新方法,该方法利用小波变换的平滑作用对包含噪声的信号进行有限离散处理,并根据小波自适应分解尺度确定阈值去嗓深度,然后根据混沌系统时噪声的免疫性和对周期信号的敏感性,把重构的信号作为周期策动力的摄动并入混沌系统,由混沌系统完成微弱信号检测;并改进了 Duf...     

混沌密码系统弱密钥随机性分析

弱密钥问题是混沌密码系统设计中的关键问题,已有研究主要从混沌序列退化角度进行分析.然而,本文指出保证混沌序列不退化的密钥参数仍可能构成混沌密码的弱密钥.本文提出以混沌密码序列随机性作为评价标准,应用严格的统计检验方法对混沌密码的弱密钥进行检测.进一步,对一类混沌密码系统进行了弱密钥研究,检测出了该系统大量未被发现的弱密钥.这确证了所提出方法的有效性.另一方面,虽然已有较多研究采用统计检验对混沌比特序列进行测试,但将统计检验用于分析混沌密码弱密钥或弱序列的研究还很少见.本文给出的统计检验弱序列分析,对当前混沌密码统计检验研究是一个很好的补充.     

An index-split Bloom filter for deep packet inspection

Deep packet inspection(DPI)scans both packet headers and payloads to search for predefined signatures.As link rates and traffc volumes of Internet are constantly growing,DPI is facing the high performance challenge of how to achieve line-speed packet processing with limited embedded memory.The recent trie bitmap content analyzer(TriBiCa)suffers from high update overhead and many false positive memory accesses,while the shared-node fast hash table(SFHT)suffers from high update overhead and large memory requi...     

Transformation of a thin-walled solid model into a surface model via solid deflation

A simplified geometric model with lower dimensionality, such as a mid-surface model, is often preferred over a detailed solid model for the analysis process, if the analysis results are not seriously impacted. In order to derive a mid-surface model from a thin-walled solid model, in this paper, we propose a novel approach called the solid deflation method. In this method, a solid model is assumed to be created by using air to inflate a shell that comprises the surface of the solid model. First, the model is simplified by the removal of any detailed features whose absence would not alter its overall shape. Next, the solid model itself can be converted into a degenerate solid model with zero thickness. Finally, a surface model is generated by splitting large faces paired in the thinned solid model, selecting one face per pair for creating a sheet model, and sewing the selected faces. Using this method, a more practical and usable mid-surface model can be very efficiently generated from a solid model because it can circumvent not only the tedious trimming and extension processes of the medial axis transformation method but also the time-consuming patch joining process of the mid-surface abstraction approach.     

Critical point analysis using domain lifting for fast geometry queries

In this paper, a general scheme for solving coherent geometric queries on freeform geometry is presented and demonstrated on a variety of problems common in geometric modeling. The underlying strategy of the approach is to lift the domain of the problem into a higher-dimensional space to enable analysis on the continuum of all possible configurations of the geometry. This higher-dimensional space supports analysis of changes to solution topology by solving for critical points using a B-spline-based constraint solver. The critical points are then used to guide fast, local methods to robustly update repeated queries. This approach effectively combines the speed of local updates with the robustness of global search solutions. The effectiveness of the domain lifting scheme (DLS) is demonstrated on several geometric computations, including accurately generating offset curves and finding minimum distances. Our approach requires a preprocessing step that computes the critical points, but once the topology is analyzed, an arbitrary number of geometry queries can be solved using fast local methods. Experimental results show that the approach solves for several hundred minimum distance computations between planar curves in one second and results in a hundredfold speedup for trimming self-intersections in offset curves.